Rapid*Closure: Algebraic Extensions of a Scalar Multiply-add Operation
نویسندگان
چکیده
منابع مشابه
Addendum to: "Infinite-dimensional versions of the primary, cyclic and Jordan decompositions", by M. Radjabalipour
In his paper mentioned in the title, which appears in the same issue of this journal, Mehdi Radjabalipour derives the cyclic decomposition of an algebraic linear transformation. A more general structure theory for linear transformations appears in Irving Kaplansky's lovely 1954 book on infinite abelian groups. We present a translation of Kaplansky's results for abelian groups into the terminolo...
متن کاملGeneralizing Matrix Multiplication for Efficient Computations on Modern Computers
Recent advances in computing allow taking new look at matrix multiplication, where the key ideas are: decreasing interest in recursion, development of processors with thousands (potentially millions) of processing units, and influences from the Algebraic Path Problems. In this context, we propose a generalized matrix-matrix multiply-add (MMA) operation and illustrate its usability. Furthermore,...
متن کاملObject Oriented Model of Generalized Matrix Multipication
Recent changes in computational sciences force reevaluation of the role of dense matrix multiplication. Among others, this resulted in a proposal to consider generalized matrix multiplication, based on the theory of algebraic semirings. The aim of this note is to outline an initial object oriented model of the generalized matrix-multiply-add operation.
متن کاملThe Artin-schreier Theorem
The algebraic closure of R is C, which is a finite extension. Are there other fields which are not algebraically closed but have an algebraic closure which is a finite extension? Yes. An example is the field of real algebraic numbers. Since complex conjugation is a field automorphism fixing Q, and the real and imaginary parts of a complex number can be computed using field operations and comple...
متن کاملMultimedia Execution Hardware Accelerator
In this paper we show that some expressions frequently used in multimedia applications can be formulated as a general add-multiply-add operation. We further show a hardwired implementation of the Add-MultiplyAdd instruction which is no more complex than the multiplier implementation. Furthermore we show that two frequently motion estimation operations, the Sum and Mean of Absolute Differences, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010